/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const ll maxn = 1e5 + 100;
ll ans[maxn], dep[maxn], f[maxn][20], mp_dep[maxn];
struct node
{
    ll y, next_s;
} e[maxn << 1];
ll head[maxn], cnt;
ll n, d;
void init()
{
    memset(head, -1, sizeof(head));
    cnt = 0;
}
void add(ll x, ll y)
{
    e[cnt].y = y;
    e[cnt].next_s = head[x];
    head[x] = cnt++;
    return;
}
void dfs(ll u, ll f)
{
    mp_dep[dep[u]] = u;
    for (ll i = head[u]; i != -1; i = e[i].next_s)
    {
        ll v = e[i].y;
        if (v == f)
            continue;
        dep[v] = dep[u] + 1;
        if (dep[v] >= d)
        {
            ans[v] = mp_dep[dep[v] - d];
        }
        dfs(v, u);
    }
    return;
}

int main()
{
    IOS;
    init();
    cin >> n >> d;
    ll x, y;
    for (ll y = 2; y <= n; y++)
    {
        cin >> x;
        add(x, y);
        add(y, x);
    }
    dfs(1, -1);
    for (ll i = 1; i <= n; i++)
    {
        ans[i] = ans[i] > 0 ? ans[i] : -1;
    }
    for (ll i = 1; i <= n; i++)
    {
        cout << ans[i] << endl;
    }
    getchar();
    getchar();
    return 0;
}
